A generalized preimage for the digital analytical hyperplane recognition
نویسندگان
چکیده
منابع مشابه
A generalized preimage for the digital analytical hyperplane recognition
HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau...
متن کاملDigital hyperplane recognition in arbitrary fixed dimension
We consider the following problem. Given a set of points M = {p1, p, . . . , pm} ⊆ R, decide whether M is a portion of a digital hyperplane and, if so, determine its analytical formulation. In our setting p, p, . . . , p may be arbitrary points (possibly, with rational and/or irrational coefficients) and the dimension n may be any arbitrary fixed integer. We provide an algorithm that solves the...
متن کاملOn digital plane preimage structure
In digital geometry, digital straightness is an important concept both for practical motivations and theoretical interests. Concerning the digital straightness in dimension 2, many digital straight line characterizations exist and the digital straight segment preimage is well known. In this article, we investigate the preimage associated to digital planes. More precisely, we present first struc...
متن کاملComputational Aspects of Digital Plane and Hyperplane Recognition
HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau...
متن کاملPartial hyperplane activation for generalized intersection cuts
The generalized intersection cut (GIC) paradigm is a recent framework for generating cutting planes in mixed integer programming with attractive theoretical properties. We investigate this computationally unexplored paradigm and observe that a key hyperplane activation procedure embedded in it is not computationally viable. To overcome this issue, we develop a novel replacement to this procedur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2009
ISSN: 0166-218X
DOI: 10.1016/j.dam.2008.05.030